Z3-connectivity in Abelian Cayley graphs
نویسندگان
چکیده
منابع مشابه
Bounding neighbor-connectivity of Abelian Cayley graphs
For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed neighborhood of the vertex is deleted from the graph. The minimum number of vertices whose subversion results in an empty, complete, or disconnected subgraph is called the neighborconnectivity of the graph. Gunther, Hartnell, and Nowakowski have shown that for any graph, neighbor-connectivity is b...
متن کاملNORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
متن کاملContractible configurations, Z3-connectivity, Z3-flows and triangularly connected graphs
Tutte conjectured that every 4-edge connected graph admits a nowhere-zero Z3-flow and Jaeger, Linial, Payan and Tarsi conjectured that every 5-edge connected graph is Z3-connected. In this paper, we characterize the triangularly connected graphs G that are Γ-connected for any Abelian group Γ with |Γ| ≥ 3. Therefore, these two conjectures are verified for the family of triangularly connected gra...
متن کاملLeader Election in Abelian Cayley Graphs
In this paper we consider the problem of distributed leader election in unoriented Abelian Cayley graphs of degree 4. This family of graphs, denoted by C G 4, include bidimensional tori of arbitrary size and chordal rings with one arbitrary chord. We present an algorithm which assumes that the only structural knowledge available to the nodes is “I am in an Abelian Cayley Graph of degree 4”. The...
متن کاملSpectral estimates for Abelian Cayley graphs
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d −O(dn−4/d ), where the implied constant is absolute. We estimate the constant in the O(dn−4/d ) notation. We show that for any fixed d, then for a large odd prime, n, theO(dn−4/d ) cannot be improved; more precisely, most d-regular graphs on prime n vertice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.04.008